A New Public Key Cryptography Algorithm Using Chaotic Systems and Hyperelliptic Curves
نویسندگان
چکیده
The aim of this paper is to make a contribution to the development of the new stronger cryptographic algorithm using chaotic systems and hyperelliptic curve. In this context, the Diffie-Hellman scheme is implemented with chaotic systems and ElGamal scheme is constructed with hyperelliptic curves. Futhermore, the complexity algorithm is determinated for proposed algorithm. Also, this algorithm is compared with other system and BER v/s SNR curves are obtain in developed experiments. Key-Words: -Chaos, -Synchronization of Chaotic Systems, -Hyperelliptic Curves.
منابع مشابه
A New Diffie-Hellman Algorithm based on Bidirectional Chaotic Systems
The aim of this paper is to development a very strong cryptographic systems using hyperelliptic Curves and Complete Synchronization for a Bidirectional Chaotic systems based on Lorenz attractor. Also performance simulations of SISO and MIMO systems over fading channels produce a benefit of 16dB for BER=10e−6 once the wireless channel is ensured. Key-Words:Diffie-Hellman Key Exchange, -Public Ke...
متن کاملElliptic and Hyperelliptic Curves: A Practical Security Analysis
Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algorithms to solve the discrete logarithm problem are generic attacks such as Pollard rho, for which it is well-known that the algorithm can be s...
متن کاملElliptic & Hyperelliptic Curves on Embedded μP
It is widely recognized that data security will play a central role in future IT systems. Providing public-key cryptographic primitives, which are the core tools for security, is often difficult on embedded processor due to computational, memory and power constraints. This contribution appears to be the first thorough comparison of two public-key families, namely elliptic curve (ECC) and hypere...
متن کاملCorrespondences on Hyperelliptic Curves and Applications to the Discrete Logarithm
The discrete logarithm is an important crypto primitive for public key cryptography. The main source for suitable groups are divisor class groups of carefully chosen curves over finite fields. Because of index-calculus algorithms one has to avoid curves of genus ≥ 4 and non-hyperelliptic curves of genus 3. An important observation of Smith [S] is that for “many” hyperelliptic curves of genus 3 ...
متن کاملApplications des fonctions thêta à la cryptographie sur courbes hyperelliptiques. (Applications of theta functions for hyperelliptic curve cryptography)
Since the mid 1980’s, abelian varieties have been widely used in cryptography: the discrete logarithm problem and the protocols that rely on it allow asymmetric encryption, signatures, authentification... For cryptographic applications, one of the most interesting examples of principally polarized abelian varieties is given by the Jacobians of hyperelliptic curves. The theory of theta functions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006